n=int(input())
a=list(map(int,input().split()))
m=int(input())
end1=[0]
start1=[0]
for i in range(m):
start,end=map(int,input().split())
start1.append(start)
end1.append(end)
for i in range(len(end1)):
if end1[i]>=sum(a) and start1[i]<=sum(a):
print(sum(a))
if start1[i]>sum(a) and sum(a)>end1[i-1]:
print(start1[i])
if sum(a)>end1[-1]:
print(-1)
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <array>
#include <deque>
#include <queue>
#include <map>
#include <set>
#define KholiD freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define KK ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long int
#define ld long double
using namespace std ;
/**
“So verily, with the hardship, there is a relief.” [Quran 94:5]
**/
ll p , l , r ;
void solve(){
ll n ;
cin >> n ;
while ( n -- )
cin >> l , p += l ;
cin >> n ;
while ( n -- && p > r )
cin >> l >> r ;
cout << ( p > r ? -1 : max ( p , l ) ) ;
}
int main(){KK
ll t = 1 ;
///cin >> t ;
while ( t -- )
solve () ;
}
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |